378A - Playing with Dice - CodeForces Solution

brute force *800

Please click on ads to support us..

Python Code: 

from collections import defaultdict
import random

a, b = list(map(int, input().split()))
q=[0,0,0]
for i in range(1,7):
    if abs(a-i)>abs(b-i):
        q[2]+=1
    elif abs(a-i)==abs(b-i):
        q[1]+=1
    else:
        q[0]+=1
print(*q)

C++ Code: 

// Online C++ compiler to run C++ program online
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int a, b;
    cin >> a >> b;
    int a1 = 0, d = 0, b1 = 0;
    for (int i = 1; i <= 6; i++)
    {
        if (abs(i - a) < abs(i - b))
        {
            a1++;
        }
        else if (abs(i - a) > abs(i - b))
        {
            b1++;
        }
        else
        {
            d++;
        }
    }
    cout << a1 << " " << d << " " << b1 << endl;

    return 0;
}


Comments

Submit
0 Comments
More Questions

580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array
461. Hamming Distance
1748. Sum of Unique Elements
897. Increasing Order Search Tree
905. Sort Array By Parity
1351. Count Negative Numbers in a Sorted Matrix
617. Merge Two Binary Trees
1450. Number of Students Doing Homework at a Given Time
700. Search in a Binary Search Tree
590. N-ary Tree Postorder Traversal
589. N-ary Tree Preorder Traversal
1299. Replace Elements with Greatest Element on Right Side
1768. Merge Strings Alternately
561. Array Partition I
1374. Generate a String With Characters That Have Odd Counts